ANNALES DU LAMSADE N ° 7 Mai 2007 Robustness in OR - DA
نویسندگان
چکیده
Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, cut, s-t cut, knapsack. Since most of these problems are NP-hard, we also investigate the approximability of these problems. Furthermore, we present algorithms to solve these problems to optimality.
منابع مشابه
7024 ANNALES DU LAMSADE N ° 6 Octobre 2006
In this paper we would like to thoroughly cover the problem of computing all kernels, i.e. minimal outranking and/or outranked independent choices in a bipolarvalued outranking digraph. First we introduce in detail the concept of bipolar-valued characterisation of outranking digraphs, choices and kernels. In a second section we present and discuss several algorithms for enumerating the kernels ...
متن کاملANNALES DU LAMSADE N ° 3 Octobre 2004
The Marquis du Condorcet recognized 200 years ago that majority rule can produce intransitive group preferences if the domain of possible (transitive) individual preference orders is unrestricted. We present results on the cardinality and structure of those maximal sets of permutations for which majority rule produces transitive results (consistent sets). Consistent sets that contain a maximal ...
متن کاملApports d'une méthode de gestion des connaissances pour la conception de systèmes d'information numérique
Alexandre Pachulski ATER, Docteur en Informatique, LAMSADE Université Paris–Dauphine Place du Maréchal De Lattre de Tassigny 75775 Paris Cedex 16 Tel : 01 44 05 46 53 Fax : 01 44 05 40 91 [email protected] http://www.lamsade.dauphine.fr Camille Rosenthal-Sabroux Maître de Conférence Directeur de Recherche LAMSADE Université Paris–Dauphine Place du Maréchal De Lattre de Tassigny 7577...
متن کاملAn exact algorithm for MAX-CUT in sparse graphs
We study exact algorithms for the max-cut problem. Introducing a new technique, we present an algorithmic scheme that computes a maximum cut in graphs with bounded maximum degree. Our algorithm runs in time O∗(2(1−(2/∆))n). We also describe a max-cut algorithm for general graphs. Its time complexity is O∗(2mn/(m+n)). Both algorithms use polynomial space. Acknowledgements: The work was done whil...
متن کامل